The Computability Path Ordering: The End of a Quest
Identifieur interne : 004297 ( Main/Exploration ); précédent : 004296; suivant : 004298The Computability Path Ordering: The End of a Quest
Auteurs : Frédéric Blanqui [France] ; Jean-Pierre Jouannaud [France] ; Albert Rubio [Espagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments à la Tait and Girard, therefore explaining the name of the improved ordering.
Url:
DOI: 10.1007/978-3-540-87531-4_1
Affiliations:
- Espagne, France
- Catalogne, Grand Est, Lorraine (région), Île-de-France
- Barcelone, Palaiseau, Vandœuvre-lès-Nancy
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001A83
- to stream Istex, to step Curation: 001A63
- to stream Istex, to step Checkpoint: 000D25
- to stream Main, to step Merge: 004408
- to stream Main, to step Curation: 004297
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The Computability Path Ordering: The End of a Quest</title><author><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name></author><author><name sortKey="Jouannaud, Jean Pierre" sort="Jouannaud, Jean Pierre" uniqKey="Jouannaud J" first="Jean-Pierre" last="Jouannaud">Jean-Pierre Jouannaud</name></author><author><name sortKey="Rubio, Albert" sort="Rubio, Albert" uniqKey="Rubio A" first="Albert" last="Rubio">Albert Rubio</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:74A381911D5DF79F58B8566DCC5B0685679B7F7D</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-87531-4_1</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-DKW046KQ-W/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001A83</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A83</idno><idno type="wicri:Area/Istex/Curation">001A63</idno><idno type="wicri:Area/Istex/Checkpoint">000D25</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000D25</idno><idno type="wicri:doubleKey">0302-9743:2008:Blanqui F:the:computability:path</idno><idno type="wicri:Area/Main/Merge">004408</idno><idno type="wicri:Area/Main/Curation">004297</idno><idno type="wicri:Area/Main/Exploration">004297</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The Computability Path Ordering: The End of a Quest</title><author><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>INRIA, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation></author><author><name sortKey="Jouannaud, Jean Pierre" sort="Jouannaud, Jean Pierre" uniqKey="Jouannaud J" first="Jean-Pierre" last="Jouannaud">Jean-Pierre Jouannaud</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LIX, Projet INRIA TypiCal, École Polytechnique and CNRS, 91400, Palaiseau</wicri:regionArea><placeName><region type="region" nuts="2">Île-de-France</region><settlement type="city">Palaiseau</settlement></placeName></affiliation></author><author><name sortKey="Rubio, Albert" sort="Rubio, Albert" uniqKey="Rubio A" first="Albert" last="Rubio">Albert Rubio</name><affiliation wicri:level="3"><country xml:lang="fr">Espagne</country><wicri:regionArea>Technical University of Catalonia, Pau Gargallo 5, 08028, Barcelona</wicri:regionArea><placeName><settlement type="city">Barcelone</settlement><region nuts="2" type="region">Catalogne</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments à la Tait and Girard, therefore explaining the name of the improved ordering.</div></front></TEI><affiliations><list><country><li>Espagne</li><li>France</li></country><region><li>Catalogne</li><li>Grand Est</li><li>Lorraine (région)</li><li>Île-de-France</li></region><settlement><li>Barcelone</li><li>Palaiseau</li><li>Vandœuvre-lès-Nancy</li></settlement></list><tree><country name="France"><region name="Grand Est"><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name></region><name sortKey="Jouannaud, Jean Pierre" sort="Jouannaud, Jean Pierre" uniqKey="Jouannaud J" first="Jean-Pierre" last="Jouannaud">Jean-Pierre Jouannaud</name></country><country name="Espagne"><region name="Catalogne"><name sortKey="Rubio, Albert" sort="Rubio, Albert" uniqKey="Rubio A" first="Albert" last="Rubio">Albert Rubio</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004297 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 004297 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:74A381911D5DF79F58B8566DCC5B0685679B7F7D
|texte= The Computability Path Ordering: The End of a Quest
}}
| This area was generated with Dilib version V0.6.33. |  |